# -*- coding: UTF-8 -*-
from typing import List

from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findMaxForm(self, strs: List[str], m: int, n: int) -> int:
        # 统计strs里1和0的总数量
        zero_count = 0
        one_count = 0

        dp = [[0] * (n + 1) for _ in range(m + 1)]
        # 遍历字符串，然后遍历背包（0和1）

        for str_item in strs:
            zero_count, one_count = 0, 0
            for item in str_item:
                if item == '1':
                    one_count += 1
                else:
                    zero_count += 1

            for i in range(m, zero_count - 1, -1):
                for j in range(n, one_count - 1, -1):
                    dp[i][j] = max(dp[i][j], dp[i - zero_count][j - one_count] + 1)

        return dp[-1][-1]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (["10", "0001", "111001", "1", "0"], 5, 3, 4),
        (["10","0","1"], 1, 1, 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        input3 = case_item[2]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.findMaxForm(input1, input2, input3)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

